All finite sets are Ramsey in the maximum norm

نویسندگان

چکیده

For two metric spaces $\mathbb X$ and $\mathcal Y$, the chromatic number $\chi(\mathbb X;\mathcal Y)$ of with forbidden Y$ is smallest $k$ such that there a coloring points colors no monochromatic copy Y$. In this paper, we show for each finite space $\mathcal{M}$ contains at least value $\chi\left(\mathbb R^n_\infty; \mathcal M \right)$ grows exponentially $n$. We also provide explicit lower upper bounds some special M$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All Triangles Are Ramsey

Given a triangle ABC and an integer r, r > 2, it is shown that for n sufficiently large and an arbitrary r-coloring of Rn one can find a monochromatic copy of ABC.

متن کامل

On the norm of the derived‎ subgroups of all subgroups of a finite group

In this paper‎, ‎we give a complete proof of Theorem 4.1(ii) and a new‎ ‎elementary proof of Theorem 4.1(i) in [Li and Shen‎, ‎On the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ J‎. ‎Algebra, ‎323  (2010) 1349--1357]‎. ‎In addition‎, ‎we also give a generalization of Baer's Theorem‎.

متن کامل

Finite groups all of whose proper centralizers are cyclic

‎A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic‎. ‎In this article we determine all finite $CC$-groups.

متن کامل

Maximum Norm Estimates in the Finite Element Method

The finite element method is considered when applied to a model Dirichlet problem on a plane polygonal domain. Rate of convergence estimates in the maximum norm, up to the boundary, are given locally. The rate of convergence may vary from point to point and is shown to depend on the local smoothness of the solution and on a possible pollution effect. In one of the applications given, a method i...

متن کامل

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Forum of Mathematics, Sigma

سال: 2021

ISSN: ['2050-5094']

DOI: https://doi.org/10.1017/fms.2021.50